#include <iostream>
#include <deque>
#include <vector>
#include <algorithm>
using namespace std;

deque<int> active;
vector<int> outdoor;
vector<int> indoor;

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int val;
        cin >> val;
        active.push_back(val);
    }
    sort(active.begin(), active.end());
    int differ = 0;
    while (!active.empty())
    {
        outdoor.push_back(active.back());
        differ += active.back();
        active.pop_back();
        if (!active.empty())
        {
            indoor.push_back(active.front());
            differ -= active.front();
            active.pop_front();
        }
    }
    cout << "Outgoing #: " << outdoor.size() << endl;
    cout << "Introverted #: " << indoor.size() << endl;
    cout << "Diff = " << differ;
    return 0;
}